Reconstructing degree sequences from k-vertex-deleted subgraphs
نویسندگان
چکیده
منابع مشابه
Reconstructing graphs from their k-edge deleted subgraphs
A graph H is an edge reconstruction of the graph G if there is a bijection p from E(G) to E(H) such that for each edge e in E(G), G\e is isomorphic to EI\fi(e). (Here G\e denotes the graph obtained from G by deleting the edge e.) We call G edge reconstructible if any edge reconstruction of G is isomorphic to G. The well-known edge-reconstruction conjecture, due to Harary [4], asserts that any g...
متن کاملVertex-deleted and Edge-deleted Subgraphs
The foremost problem in this area of graph theory is the Reconstruction Conjecture which states that a graph is reconstructible from its collection of vertex-deleted subgraphs. In spite of several attempts to prove the conjecture only very partial results have been obtained. Several of these results do however bring to light interesting structural relationships between a graph and its subgraphs...
متن کاملVertex-disjoint subgraphs with high degree sums
For a graph G, we denote by σ2(G) the minimum degree sum of two non-adjacent vertices if G is non-complete; otherwise, σ2(G) = +∞. In this paper, we give the following two results; (i) If s1 and s2 are integers with s1, s2 ≥ 2 and if G is a non-complete graph with σ2(G) ≥ 2(s1 + s2 + 1) − 1, then G contains two vertexdisjoint subgraphs H1 and H2 such that each Hi is a graph of order at least si...
متن کاملGenerating Minimal k-Vertex Connected Spanning Subgraphs
We show that minimal k-vertex connected spanning subgraphs of a given graph can be generated in incremental polynomial time for any fixed k.
متن کاملAlgebraic connectivity for vertex-deleted subgraphs, and a notion of vertex centrality
Let G be a connected graph, suppose that v is a vertex of G, and denote the subgraph formed from G by deleting vertex v by G \ v. Denote the algebraic connectivities of G and G \ v by α(G) and α(G \ v), respectively. In this paper, we consider the functions φ(v) = α(G) − α(G \ v) and κ(v) = α(G\v) α(G) , provide attainable upper and lower bounds on both functions, and characterise the equality ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1990
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90035-g